Modelling Conditional Rewriting Logic in Structured Categories
نویسندگان
چکیده
منابع مشابه
Modelling Conditional Rewriting Logicin Structured
We reformulate and generalize the functorial model of Meseguer's conditional full rewriting logic by using inserter, a weighted limit in 2-categories. Indeed 2-categories are categories enriched in Cat. Therefore this method also can be extended to sesqui-categories and other enriched categories, with which we can model various aspects of rewritings and strategies.
متن کاملTranslating Logic Programs into Conditional Rewriting Systems
In this paper a translation from a subclass of logic programs consisting of the simply moded logic programs into rewriting systems is deened. In these rewriting systems conditions and explicit substitutions may be present. We argue that our translation is more natural than previously studied ones and establish a result showing its correctness. programming: transforming logic programs to lazy fu...
متن کاملConditional Narrowing Modulo in Rewriting Logic and Maude
This work studies the relationship between verifiable and computable answers for reachability problems in rewrite theories with an underlying membership equational logic. These problems have the form (∃x̄)s(x̄) →∗ t(x̄), with x̄ some variables, or a conjunction of several of these subgoals. A calculus that solves this kind of problems has been developed and proved correct. Given a reachability prob...
متن کاملRewriting the Conditions in Conditional Rewriting
Category theory has been used to provide a semantics for term rewriting systems at an intermediate level of abstraction between the actual syntax and the relational model. Recently we have developed a semantics for TRSs using monads which generalises the equivalnece between algebraic theories and nitary monads on the category Sets. This semantics underpins the recent categorical proofs of state...
متن کاملBi-rewriting rewriting logic
Rewriting logic appears to have good properties as logical framework, and can be useful for the development of programming languages which attempt to integrate various paradigms of declarative programming. In this paper I propose to tend towards the operational semantics for such languages by basing it on bi-rewrite systems and ordered chaining calculi which apply rewrite techniques to rst-orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1996
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00031-3